Landau's algorithm

In mathematics, Landau's algorithm, named after Susan Landau, is an algorithm for deciding which nested radicals can be denested.[1]

Notes and references

  1. ^ Landau, Susan (1992), "Simplification of nested radicals", SIAM Journal on Computing 21 (1): 85–110, doi:10.1137/0221009  (link to a conference version that can be viewed by anyone)